Estimation from nonlinear observations via convex programming with application to bilinear regression
نویسندگان
چکیده
منابع مشابه
Nonparametric Estimation via Convex Programming
In the paper, we focus primarily on the problem of recovering a linear form g x of unknown “signal” x known to belong to a given convex compact set X ⊂ R from N independent realizations of a random variable ι taking values in a finite set, the distribution p of ι being affinely parameterized by x: p = Ax + b. With no additional assumptions on X and A, we develop minimax optimal, within an absol...
متن کاملAnchored Regression: Solving Random Convex Equations via Convex Programming
We consider the problem of estimating a solution to (random) systems of equations that involve convex nonlinearities which has applications in machine learning and signal processing. Conventional estimators based on empirical risk minimization generally lead to non-convex programs that are often computationally intractable. We propose anchored regression, a new approach that utilizes an anchor ...
متن کاملLinear and Nonlinear Regression with Application to Unbalance Estimation
This paper considers estimation of parameters that enters nonlinearly in a regression model. The problem formulation is closely connected to unbalance estimation of rotating machinery. The parameter estimation problem can after approximation be formulated as a linear estimation procedure, while neglecting the effects of the disturbing term. Two such estimators are derived. In addition, a third ...
متن کاملNonlinear robust optimization via sequential convex bilevel programming
In this paper, we present a novel sequential convex bilevel programming algorithm for the numerical solution of structured nonlinear min–max problemswhich arise in the context of semi-infinite programming. Here, our main motivation are nonlinear inequality constrained robust optimization problems. In the first part of the paper, we propose a conservative approximation strategy for such nonlinea...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2019
ISSN: 1935-7524
DOI: 10.1214/19-ejs1567